Polyominoes determined by involutions

نویسندگان

  • Filippo Disanto
  • Simone Rinaldi
چکیده

A permutomino of size n is a polyomino determined by particular pairs (π1, π2) of permutations of length n, such that π1(i) 6= π2(i), for 1 ≤ i ≤ n. In this paper we consider the class of convex permutominoes which are symmetric with respect to the diagonal x = y. We determine the number of these permutominoes according to the dimension and we characterize the class of permutations associated to these objects as particular involutions of length n. Résumé. Les permutominos de taille n sont des polyominos déterminés par certaines paires de permutations (π1, π2) de taille n, telles que π1(i) 6= π2(i), pour tout 1 ≤ i ≤ n. Dans cet article nous considérons la classe des permutominos convexes qui sont symétriques par rapport à la diagonale x = y. Nous déterminons le nombre de ces permutominos en fonction de leur taille et nous caractérisons la classe des permutations associées à ces objets comme un certain ensemble d’involutions de taille n.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Number of Line-Convex Directed Polyominoes Having the Same Orthogonal Projections

The number of line-convex directed polyominoes with given horizontal and vertical projections is studied. It is proven that diagonally convex directed polyominoes are uniquely determined by their orthogonal projections. The proof of this result is algorithmical. As a counterpart, we show that ambiguity can be exponential if antidiagonal convexity is assumed about the polyomino. Then, the result...

متن کامل

Polyominoes determined by permutations

In the plane Z × Z a cell is a unit square, and a polyomino is a finite connected union of cells having no cut point. Polyominoes are defined up to translations. A column (row) of a polyomino is the intersection between the polyomino and an infinite strip of cells whose centers lie on a vertical (horizontal) line. The enumeration problem for general polyominoes is difficult to solve and still o...

متن کامل

Winning Strategies for Hexagonal Polyomino Achievement

In polyomino achievement games, two players alternately mark the cells of a tessellation and try to achieve a given polyomino. In [2], Bode and Harborth investigated polyomino achievement games for the hexagonal tessellation and determined all but five polyominoes with at most five cells whether they are achieved by the first player. In this paper, we show winning strategies for three hexagonal...

متن کامل

Rectangular polyomino set weak (1, 2)-achievement games

In a polyomino set (1,2)-achievement game the maker and the breaker alternately mark one and two previously unmarked cells respectively. The maker's goal is to mark a set of cells congruent to one of a given set of polyominoes. The breaker tries to prevent the maker from achieving his goal. The teams of polyominoes for which the maker has a winning strategy is determined up to size 4. In set ac...

متن کامل

Exactly solved models of polyominoes and polygons

This chapter deals with the exact enumeration of certain classes of selfavoiding polygons and polyominoes on the square lattice. We present three general approaches that apply to many classes of polyominoes. The common principle to all of them is a recursive description of the polyominoes which then translates into a functional equation satisfied by the generating function. The first approach a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008